Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

超声速湍流混合层中小激波结构的实验研究

在对流马赫数为1.24的超声速湍流混合层风洞中,以NPLS实验技术为基础观察到了小激波结构。分析了小激波结构产生时的混合层流场参数,给出了从实验图像中确定对流马赫数的方法,避免了理论分析不必要的假设。探讨了小激波结构产生、发展的一般规律。     

基于声检测的爆炸冲击场剖面可视化技术

阐述了声发射的检测原理,研究了冲击波作用下物体的声发射特性,并利用声发射的不可逆效应(Kaiser效应),提出了一种基于测试的冲击场层析技术.给出了实现流程图及其若干关键技术,如主副鉴别、前沿鉴别等.实验结果表明该技术有一定的实用性,为冲击波作用下物体内部的位错形成和滑移机制的研究提供了一种手段.最后对下一步要解决的问题进行了说明.     

高层建筑避难设施消防设计探讨

高层建筑发生火灾后,人员安全疏散将主要依赖高层建筑内部的避难设施。因此,在楼内一定区域应设计避难设施,并对避难区域进行正压送风,防止烟气进入,保证人员安全。讨论了高层建筑避难设施设计并着重分析了避难层防烟设计中的几个问题。     

雷诺数对沟槽减阻特性影响的数值分析

采用雷诺平均N-S方程和RNGk-ε湍流模型计算V型沟槽面的湍流边界层流动和黏性阻力,通过改变来流速度大小和沟槽面布置位置,研究了雷诺数对沟槽减阻特性的影响规律。计算结果表明,来流速度对沟槽减阻率的影响很大,对于一种尺度的V型沟槽,存在着一个具有较好减阻效果的来流速度范围,最大减阻率可达8.6%;沟槽面在沿来流方向上的布置位置对其减阻效果的影响则非常小。     

钢丝绳隔振器冲击特性试验研究

采用气缸式冲击模拟台对钢丝绳隔振器进行了冲击特性试验研究,介绍了试验系统及测量方法。在比较符合舰船实际冲击环境的情况下,获得了钢丝绳隔振器压缩和拉伸方向完整的特性曲线。试验结果分析表明,钢丝绳隔振器表现出明显的冲击软化现象,其冲击刚度特性小于静刚度和动刚度,而且它具有大阻尼耗能特性,是比较理想的抗冲元件。     

利用火箭深弹系统拦截鱼雷的技术改进方法探析

多功能、多用途是火箭深弹系统的主要发展方向之一。根据水面舰艇武器装备的实际,仅从拦截潜艇发射的鱼雷角度出发,对舰载火箭深弹系统拦截来袭鱼雷的可行性进行了分析。在此基础上,探讨了利用火箭深弹系统拦截鱼雷的系统选择、深弹战斗部的开发、引信选型、发射管安装及配置、火控系统的改进等关键问题,并提出了一些具体的改进方法。